Estimation error bounds for denoising by sparse approximation

نویسندگان

  • Alyson K. Fletcher
  • Kannan Ramchandran
چکیده

If a signal is known to have a sparse representation with respect to a given frame, thc signal can he estimated from a noise-corrupted observation of the signal by finding the hest sparse approximation to the observation. ‘The ability to remove noise in this manner depends on the frame heing designed to efficiently represent the signal while it ine@cienf/v represents the noise. ‘This paper gives hounds to show how inefficiently white Gaussian noise is represented by sparse linear combinations of frame vectors. Combined with knowledge of the approximation efficiency of a given family of frames for a given signal class, this work leads lo a better understanding of the merits of frame denoising. 1. DENOISING BY SPARSE APPROXIMATION Consider the problem of estimating an unknown signal 2: E R” from the noisy observation y = z + d where d E R” has the N ( o , f f 2 / N ) distribution, If z is known to lie in a given K-dimensional subspace of R”, the situation can immediately he improved hy projecting y to the given suhspace; since the noise distribution is spherically symmetric this leaves only K / N fraction ofthe original noise. Further information ahout the distribution of z could he exploited to remove even more noise. In many scenarios in which one attempts to estimate z from y, to know with certainty the K-dimensional subspace that contains z is too much to ask. However, it may he reasonable to know a set of &‘-dimensional subspaces such that the union contains or can closely approximate :c. In other words, a basis may be known such that a K-term nonlinear approximation is very accurate [I ] . (Wavelet bases have this property for piecewise smooth signals.) At high SNR (small u2), the selection of the I<-dimensional suhspace is unperturbed by d. The approximation error is approximately KO* + f.v(K), where f , w ( h ) is a decreasing function of I< that represents the error of the optimal h-term nonlinear approximation of z. Now suppose U = {u~,. . . , un,} c RN is chosen so that the class of signals of interest can he sparsely repreKannun Ramchandrun Universi ty of California, Berkeley [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimation Error Bounds for Frame Denoising

A subspace-based method for denoising with a frame works as follows: If a signal is known to have a sparse representation with respect to the frame, the signal can be estimated from a noise-corrupted observation of the signal by finding the best sparse approximation to the observation. The ability to remove noise in this manner depends on the frame being designed to efficiently represent the si...

متن کامل

A Novel Image Denoising Method Based on Incoherent Dictionary Learning and Domain Adaptation Technique

In this paper, a new method for image denoising based on incoherent dictionary learning and domain transfer technique is proposed. The idea of using sparse representation concept is one of the most interesting areas for researchers. The goal of sparse coding is to approximately model the input data as a weighted linear combination of a small number of basis vectors. Two characteristics should b...

متن کامل

Estimation via Sparse Approximation : Error Bounds and Random Frame Analysis

Estimation via Sparse Approximation: Error Bounds and Random Frame Analysis

متن کامل

Compressive Wideband Spectrum Sensing for Fixed Frequency Spectrum Allocation

Too high sampling rate is the bottleneck to wideband spectrum sensing for cognitive radio (CR). As the survey shows that the sensed signal has a sparse representation in frequency domain in the mass, compressed sensing (CS) can be used to transfer the sampling burden to the digital signal processor. An analog to information converter (AIC) can randomly sample the received signal with sub-Nyquis...

متن کامل

Denoising by Sparse Approximation: Error Bounds Based on Rate-Distortion Theory

1Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA 94720-1770, USA 2Flarion Technologies Inc., Bedminster, NJ 07921, USA 3Department of Electrical Engineering and Computer Science and Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA 02139-4307, USA 4Department of Electrical Engineering and Computer Sciences...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003